Mega Code Archive

Categories
1) Android
2) ASP.Net
3) ASP.Net Tutorial
4) C
5) C Tutorial
6) C#
7) C# Book
8) C# by API
9) C# Tutorial
10) C++
11) C++ Tutorial
12) Delphi
13) Flash ActionScript
14) Flex
15) Java
16) Java Book
17) Java by API
18) Java Tutorial
19) JavaScript DHTML
20) JavaScript Reference
21) JavaScript Tutorial
22) MSOfficeExcel 2007 Tutorial
23) MSOfficePowerPoint 2007 Tutorial
24) MSOfficeWord 2007 Tutorial
25) MSSQL
26) MSSQL Tutorial
27) MySQL
28) MySQL Tutorial
29) Oracle PLSQL
30) Oracle PLSQL Tutorial
31) Perl
32) Php
33) PostgreSQL
34) Python
35) Python Tutorial
36) Ruby
37) Silverlight
38) VB.Net
39) VB.Net by API
40) VB.Net Tutorial
41) Visual C++ .NET
42) VisualBasic Script
43) XML
44) XML Tutorial

 

C++ Tutorial
1) Array
2) Bitset
3) Class
4) Data Types
5) Deque
6) Development
7) Exceptions
8) File Stream
9) Function
10) Language Basics
11) List
12) Map Multimap
13) Operator Overloading
14) Operators Statements
15) Pointer
16) Queue Stack
17) Set Multiset
18) STL Algorithms Binary Search
19) STL Algorithms Heap
20) STL Algorithms Helper
21) STL Algorithms Iterator
22) STL Algorithms Merge
23) STL Algorithms Min Max
24) STL Algorithms Modifying Sequence Operations
25) STL Algorithms Non Modifying Sequence Operations
26) STL Algorithms Sorting
27) STL Introduction
28) String
29) Structure
30) Template
31) Valarray
32) Vector

Deque
1) Change size to four elements
2) Change the values of some of deques elements
3) Checking if One Container Is Less Than or Greater Than Another
4) Clear dq by popping elements one at a time
5) Combine insert and end to add elements to a deque
6) Constructing a Container with Values from the Standard Input
7) Create a deque
8) Create an empty deque and then assign it a sequence that is the reverse of deque
9) Create another deque that contains a subrange of dq
10) Create your own stack based on deque
11) Define iterator for deque
12) Deque
13) Deque for char type
14) Deque push_back( value )
15) Deque push_front( value )
16) Dequeint
17) Illustrating the generic search algorithm
18) Initialize deque with 26 copies of the letter x
19) Insert value into every element but the first
20) Print out a deque, reference its content by index
21) Print the contents in reverse order using reverse_iterator and functions rbegin() and rend()
22) Push an element onto the front of deque
23) Push element into deque and print all elements
24) Remove all elements with values less than 50
25) Remove first and last element
26) Resize a deque
27) STL deque
28) Transform deque with boolean function
29) Use assign and push_back, push_front to insert element to a deque
30) Use copy function to print all elements in a deque
31) Use find the search an element in deque
32) Use generic deque to store chars
33) Use generic deque to store integers
34) Use generic deque to store strings
35) Use indexer to add elements to a deque
36) Use insert iterator adaptors to insert one deque into another by way of the copy() algorithm
37) Use iterator and reverse_iterator with deque
38) Use reverse function on deque
39) Use std
40) Use subscript operator to modify element at location 1
41) Use subscript operator to obtain elements of values
42) Using the Front of a Deque